Generalized Delaunay Graphs with respect to any Convex Set are Plane Graphs
نویسنده
چکیده
We consider two types of geometric graphs on point sets on the plane based on a plane set C: one obtained by translates of C, another by positively scaled translates (homothets) of C. For compact and convex C, graphs defined by scaled translates of C, i.e., Delaunay graphs based on C, are known to be plane graphs. We show that as long as C is convex, both types of graphs are plane graphs.
منابع مشابه
Constrained Empty-Rectangle Delaunay Graphs
Given an arbitrary convex shape C, a set P of points in the plane and a set S of line segments whose endpoints are in P , a constrained generalized Delaunay graph of P with respect to C denoted CDGC(P ) is constructed by adding an edge between two points p and q if and only if there exists a homothet of C with p and q on its boundary and no point of P in the interior visible to both p and q. We...
متن کاملDensity of range capturing hypergraphs
For a finite set X of points in the plane, a set S in the plane, and a positive integer k, we say that a k-element subset Y of X is captured by S if there is a homothetic copy S′ of S such that X ∩ S′ = Y , i.e., S′ contains exactly k elements from X. A k-uniform S-capturing hypergraph H = H(X,S, k) has a vertex set X and a hyperedge set consisting of all kelement subsets of X captured by S. In...
متن کاملOn the Stretch Factor of Convex Delaunay Graphs
Let C be a compact and convex set in the plane that contains the origin in its interior, and let S be a finite set of points in the plane. The Delaunay graph DGC(S) of S is defined to be the dual of the Voronoi diagram of S with respect to the convex distance function defined by C. We prove that DGC(S) is a t-spanner for S, for some constant t that depends only on the shape of the set C. Thus, ...
متن کاملSequential Elimination Graphs
A graph is chordal if it does not contain any induced cycle of size greater than three. An alternative characterization of chordal graphs is via a perfect elimination ordering, which is an ordering of the vertices such that, for each vertex v, the neighbors of v that occur later than v in the ordering form a clique. Akcoglu et al [2] define an extension of chordal graphs whereby the neighbors o...
متن کاملConnections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to a factor depending on the cone number k and the dimension of the space. TD-Delaunay graphs, a.k.a. triangular-distance Delaunay triangulations introduced by Chew, have been shown to be plane 2-spanners of the 2D Euclid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1012.4881 شماره
صفحات -
تاریخ انتشار 2010